Towards a Duration Calculus Proof Assistant in PVS

نویسندگان

  • Jens Ulrik Skakkebæk
  • Natarajan Shankar
چکیده

The Duration Calculus (DC) is an interval temporal logic for reasoning about real-time systems. This paper describes a tool for constructing DC speciications and checking DC proofs. The proof assistant is implemented by encoding the semantics of DC within the higher-order logic of a general-purpose speciication and veriication environment called PVS. We develop a Gentzen style sequent proof system for DC which we show to be sound with respect to the semantic encoding. We exploit the similarity between the sequent calculus of PVS and the sequent calculus of DC to obtain a DC proof system where the proofs are carried out in PVS at the semantic level, but appear as proofs in the DC proof system. The resulting system, called PC/DC, retains the speciication and veriication capabilities of PVS within the framework of the Duration Calculus. We present an example of a DC proof whose PC/DC presentation closely follows the lines of the corresponding pencil-and-paper DC arguments. Our approach can be applied to speciication logics other than DC.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Theory for Abstract Reduction Systems in PVS

A theory for Abstract Reduction Systems (ARS) in the proof assistant PVS (Prototype Verification System) is described. Adequate specifications of basic definitions and notions such as reduction, confluence, normal form are given and well-known results proved, which includes non trivial ones such as Noetherian Induction, Newman’s Lemma and its generalizations, and Commutation Lemma among others....

متن کامل

Parameterized Verification of the FLASH Cache Coherence Protocol by Compositional Model Checking

We consider the formal verification of the cache coherence protocol of the Stanford FLASH multiprocessor for N processors. The proof uses the SMV proof assistant, a proof system based on symbolic model checking. The proof process is described step by step. The protocol model is derived from an earlier proof of the FLASH protocol, using the PVS system, allowing a direct comparison between the tw...

متن کامل

Accurate Summation: Towards a Simpler and Formal Proof

This paper provides a simpler proof of the “accurate summation” algorithm proposed by Demmel and Hida in [1]. It also gives improved bounds in some cases, and examples showing that those new bounds are optimal. This simpler proof will be used to obtain a computer-generated proof of Demmel-Hida’s algorithm, using a proof assistant like HOL, PVS or Coq.

متن کامل

A Sequent Calculus for Signed Interval Logic

We propose and discuss a complete sequent calculus formulation for Signed Interval Logic (SIL) with the chief purpose of improving proof support for SIL in practice. The main theoretical result is a simple characterization of the limit between decidability and undecidability of quantifier-free SIL. We present a mechanization of SIL in the generic proof assistant Isabelle and consider techniques...

متن کامل

Reasonong about Classess in Object-Oriented Languages: Logical Models and Tools

A formal language ccsl is introduced for describing specii-cations of classes in object-oriented languages. We show how class speci-cations in ccsl can be translated into higher order logic. This allows us to reason about these speciications. In particular, it allows us (1) to describe (various) implementations of a particular class speciication, (2) to develop the logical theory of a speciic c...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1994